Torsors of isotropic reductive groups over Laurent polynomials

نویسندگان

چکیده

Let k be a field of characteristic 0. G reductive group over the ring Laurent polynomials R=k[x_1^{\pm 1},...,x_n^{\pm 1}]. We prove that has isotropic rank >=1 R iff it fractions k(x_1,...,x_n) R, and if this is case, then natural map H^1_{et}(R,G)\to H^1_{\et}(k(x_1,...,x_n),G) trivial kernel, loop reductive, i.e. contains maximal R-torus. In particular, we settle in positive conjecture V. Chernousov, P. Gille, A. Pianzola H^1_{Zar}(R,G)=* for such groups G. also deduce >=2, non-stable K_1-functors K_1^G(R)\to K_1^G( k((x_1))...((x_n)) ) injective, an isomorphism moreover semisimple.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elementary Subgroups of Isotropic Reductive Groups

Let G be a not necessarily split reductive group scheme over a commutative ring R with 1. Given a parabolic subgroup P of G, the elementary group EP (R) is defined to be the subgroup of G(R) generated by UP (R) and UP−(R), where UP and UP− are the unipotent radicals of P and its opposite P −, respectively. It is proved that if G contains a Zariski locally split torus of rank 2, then the group E...

متن کامل

Reductive Groups over Fields

These are lecture notes that Tony Feng live-TEXed from a course given by Brian Conrad at Stanford in“winter” 2015, which Feng and Conrad edited afterwards. Two substitute lectures were delivered (by Akshay Venkatesh and Zhiwei Yun) when Conrad was out of town. This is a sequel to a previous course on the general structure of linear algebraic groups; some loose ends from that course (e.g., Cheva...

متن کامل

Undecidability in Matrices over Laurent Polynomials

We show that it is undecidable for finite sets S of upper triangular 4 × 4matrices over Z[x, x−1] whether or not all elements in the semigroup generated by S have a nonzero constant term in some of the Laurent polynomials of the first row. This result follows from a representations of the integer weighted finite automata by matrices over Laurent polynomials.

متن کامل

Decompositions of Laurent Polynomials

In the 1920’s, Ritt studied the operation of functional composition g ◦ h(x) = g(h(x)) on complex rational functions. In the case of polynomials, he described all the ways in which a polynomial can have multiple ‘prime factorizations’ with respect to this operation. Despite significant effort by Ritt and others, little progress has been made towards solving the analogous problem for rational fu...

متن کامل

Characters of Reductive Groups over Finite Fields

Let E be a connected reductive algebraic group over C and let W be its Weyl group. The Springer correspondence allows us to parametrize the irreducible representations E of W as F = F^^ where u is a unipotent element in G (up to conjugacy) and <p is an irreducible representation of the group of components AH(u) = ZH(u)IZ°H(u). (However, not all <p arise in the parametrization.) For F = F^Uttp) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Documenta Mathematica

سال: 2021

ISSN: ['1431-0635', '1431-0643']

DOI: https://doi.org/10.4171/dm/825